Borel-Piecewise Continuous Reducibility for Uniformization Problems
نویسندگان
چکیده
منابع مشابه
Borel-piecewise continuous reducibility for uniformization problems
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and Gδ-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of Gδ-piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of Gδ-piecewise continuous reductions for unif...
متن کاملCountable Borel equivalence relations, Borel reducibility, and orbit equivalence
ing from the proof given above for Gaboriau-Popa we obtain theorems such as: Theorem 2.10 Let (X, d) be a complete, separable metric space equipped with an atomless Borel probability measure μ. Suppose Γ acts ergodically by measure preserving transformations on (X,μ) and the action on (X, d) is expansive. Let (Et)0<t<1 be a collection of distinct countable Borel equivalence relations on X with:...
متن کاملBorel reducibility and finitely Hölder(α) embeddability
Let (Xn, dn), n ∈ N be a sequence of pseudo-metric spaces, p ≥ 1. For x, y ∈ ∏n∈NXn, let (x, y) ∈ E((Xn)n∈N; p) ⇔ ∑ n∈N dn(x(n), y(n)) p < +∞. For Borel reducibility between equivalence relations E((Xn)n∈N; p), we show it is closely related to finitely Hölder(α) embeddability between pseudometric spaces.
متن کاملEffective Borel measurability and reducibility of functions
The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire sp...
متن کاملInfinite-Time Turing Machines and Borel Reducibility
In this document I will outline a couple of recent developments, due to Joel Hamkins, Philip Welch and myself, in the theory of infinite-time Turing machines. These results were obtained with the idea of extending the scope of the study of Borel equivalence relations, an area of descriptive set theory. I will introduce the most basic aspects of Borel equivalence relations, and show how infinite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2017
ISSN: 1860-5974
DOI: 10.2168/lmcs-12(4:4)2016